On transitive Boolean relations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lifted Inference on Transitive Relations

Lifted inference algorithms are able to boost efficiency through exploiting symmetries of the underling firstorder probabilistic models. Models with transitive relations (e.g., if X and Y are friends and so are Y and Z, then X and Z will likely be friends) are essential in social network analysis. With n elements in a transitive relation model, the computational complexity of exact propositiona...

متن کامل

On the construction of M-transitive relations

The transitivity of fuzzy relations with respect to a subset of quasi-linear functions in the unit interval is studied. A new construction of transitive relations with respect to an archimedean t-norm is proposed.

متن کامل

Counting Transitive Relations

In order to count partial orders on a set of n points, it seems necessary to explicitly construct a representative of every isomorphism type. While that is done, one might as well determine their automorphism groups. In this note it is shown how several other types of binary relations can be counted, based on an explicit enumeration of the partial orders and their automorphism groups. A partial...

متن کامل

Transitive Closure of Fuzzy Relations

In this paper X, Y denote non empty sets. Let X be a non empty set. Observe that every membership function of X is real-yielding. Let f , g be real-yielding functions. The predicate f ⊑ g is defined by: (Def. 1) dom f ⊆ dom g and for every set x such that x ∈ dom f holds f(x) ¬ g(x). Let X be a non empty set and let f , g be membership functions of X. Let us observe that f ⊑ g if and only if: (...

متن کامل

Rewrite Techniques for Transitive Relations

We propose inference systems for dealing with transitive relations in the context of resolutiontype theorem proving. These inference mechanisms are based on standard techniques from term rewriting and represent a refinement of chaining methods. We establish their refutational completeness and also prove their compatibility with the usual simplification techniques used in rewrite-based theorem p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 1951

ISSN: 0011-4642,1572-9141

DOI: 10.21136/cmj.1951.100029